Proper Policies in Infinite-State Stochastic Shortest Path Problems
نویسندگان
چکیده
منابع مشابه
Proper Policies in Infinite-State Stochastic Shortest Path Problems
We consider stochastic shortest path problems with infinite state and control spaces, a nonnegative cost per stage, and a termination state. We extend the notion of a proper policy, a policy that terminates within a finite expected number of steps, from the context of finite state space to the context of infinite state space. We consider the optimal cost function J*, and the optimal cost functi...
متن کاملFinding objects through stochastic shortest path problems
This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using offthe-shelf domain-independent probabilistic planners. ...
متن کاملAn Analysis of Stochastic Shortest Path Problems
We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative. We prove natural generalizations of the standard results for ...
متن کاملSolving Stochastic Shortest-Path Problems with RTDP
We present a modification of the Real-Time Dynamic Programming (rtdp) algorithm that makes it a genuine off-line algorithm for solving Stochastic Shortest-Path problems. Also, a new domainindependent and admissible heuristic is presented for Stochastic Shortest-Path problems. The new algorithm and heuristic are compared with Value Iteration over benchmark problems with large state spaces. The r...
متن کاملStochastic Safest and Shortest Path Problems
Optimal solutions to Stochastic Shortest Path Problems (SSPs) usually require that there exists at least one policy that reaches the goal with probability 1 from the initial state. This condition is very strong and prevents from solving many interesting problems, for instance where all possible policies reach some dead-end states with a positive probability. We introduce a more general and rich...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2018
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2811781